CRYPTOGRAPHIC SCHEMES, KEY EXCHANGE, PUBLIC KEY
نویسندگان
چکیده
منابع مشابه
Cryptographic schemes, key exchange, public key
General cryptographic schemes are presented where keys can be one-time or ephemeral. Processes for key exchange are derived. Public key cryptographic schemes based on the new systems are established. Authentication and signature schemes are easy to implement. The schemes may be integrated with error-correcting coding schemes so that encryption/coding and decryption/decoding may be done simultan...
متن کاملCryptography. key exchange, public key
General cryptographic schemes are presented where keys can be one-time or ephemeral. Processes for key exchange are derived. Public key cryptographic schemes based on the new systems are established. Authentication and signature schemes are easy to implement. The schemes may be integrated with error-correcting coding schemes so that encryption/coding and decryption/decoding may be done simultan...
متن کاملRobust Key-Evolving Public Key Encryption Schemes
We propose a key-evolving paradigm to deal with the key exposure problem of public key encryption schemes. The key evolving paradigm is like the one used for forward-secure digital signature schemes. Let time be divided into time periods such that at time period j, the decryptor holds the secret key SKj , while the public key PK is fixed during its lifetime. At time period j, a sender encrypts ...
متن کاملBuilding Key-Private Public-Key Encryption Schemes
In the setting of identity-based encryption with multiple trusted authorities, TA anonymity formally models the inability of an adversary to distinguish two ciphertexts corresponding to the same message and identity, but generated using different TA master public-keys. This security property has applications in the prevention of traffic analysis in coalition networking environments. In this pap...
متن کاملFaster Cryptographic Key Exchange on Hyperelliptic Curves
We present a new approach to key exchange based on divisor arithmetic for the real model of a hyperelliptic curve over a finite field, as opposed to the imaginary representation that is normally used for cryptographic applications. Using generic divisor arithmetic, our protocol is almost fifteen percent faster than conventional key exchange using hyperelliptic curves, with the most significant ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Pure and Apllied Mathematics
سال: 2014
ISSN: 1311-8080,1314-3395
DOI: 10.12732/ijpam.v93i6.13